Improving Random Walk Estimation Accuracy with Uniform Restarts
نویسندگان
چکیده
This work proposes and studies the properties of a hybrid sampling scheme that mixes independent uniform node sampling and random walk (RW)-based crawling. We show that our sampling method combines the strengths of both uniform and RW sampling while minimizing their drawbacks. In particular, our method increases the spectral gap of the random walk, and hence, accelerates convergence to the stationary distribution. The proposed method resembles PageRank but unlike PageRank preserves time-reversibility. Applying our hybrid RW to the problem of estimating degree distributions of graphs shows promising results.
منابع مشابه
Decipherment with a Million Random Restarts
This paper investigates the utility and effect of running numerous random restarts when using EM to attack decipherment problems. We find that simple decipherment models are able to crack homophonic substitution ciphers with high accuracy if a large number of random restarts are used but almost completely fail with only a few random restarts. For particularly difficult homophonic ciphers, we fi...
متن کاملEstimating graph parameters via random walks with restarts
In this paper we discuss the problem of estimating graph parameters from a random walk with restarts. In this setting, an algorithm observes the trajectory of a random walk over an unknown graph G, starting from a vertex x. The algorithm also sees the degrees along the trajectory. The only other power that the algorithm has is to request that the random walk be reset to its initial state x at a...
متن کاملAn Integrated MEMS Gyroscope Array with Higher Accuracy Output
In this paper, an integrated MEMS gyroscope array method composed of two levels of optimal filtering was designed to improve the accuracy of gyroscopes. In the firstlevel filtering, several identical gyroscopes were combined through Kalman filtering into a single effective device, whose performance could surpass that of any individual sensor. The key of the performance improving lies in the opt...
متن کاملPath Collapse for an Inhomogeneous Random Walk
On an open interval we follow the paths of a Brownian motion which returns to a fixed point as soon as it reaches the boundary and restarts afresh indefinitely. We determine that two paths starting at different points either cannot collapse or they do so almost surely. The problem can be modelled as a spatially inhomogeneous random walk on a group and contrasts sharply with the higher dimension...
متن کاملLow-autocorrelation binary sequences: On improved merit factors and runtime predictions to achieve them
Search for binary sequences with a high figure of merit, known as the low autocorrelation binary sequence (labs) problem, represents a formidable computational challenge. In 2003, two stochastic solvers reported computational complexity of O(1.423) and O(1.370), refined to O(1.5097) and O(1.4072) for L odd in this paper. New experiments, with the solver from 2009, demonstrate (a) the asymptotic...
متن کامل